The Ariadne's Clew Algorithm

We present a new approach to path planning, called the "Ariadne's clew algorithm". It is designed to find paths in high-dimensional continuous spaces and applies to robots with many degrees of freedom in static, as well as dynamic environments - ones where obstacles may move. The Ariadne's clew algorithm comprises two sub-algorithms, called Search and Explore, applied in an interleaved manner. Explore builds a representation of the accessible space while Search looks for the target. Both are posed as optimization problems. We describe a real implementation of the algorithm to plan paths for a six degrees of freedom arm in a dynamic environment where another six degrees of freedom arm is used as a moving obstacle. Experimental results show that a path is found in about one second without any pre-processing

Using Bayesian Programming for Multisensor Multi-Target Tracking in Automative Applications

A prerequisite to the design of future Advanced Driver Assistance Systems for cars is a sensing system providing all the information required for high-level driving assistance tasks. Carsense is a European project whose purpose is to develop such a new sensing system. It will combine different sensors (laser, radar and video) and will rely on the fusion of the information coming from these sensors in order to achieve better accuracy, robustness and an increase of the information content. This paper demonstrates the interest of using probabilistic reasoning techniques to address this challenging multi-sensor data fusion problem. The approach used is called Bayesian Programming. It is a general approach based on an implementation of the Bayesian theory. It was introduced rst to design robot control programs but its scope of application is much broader and it can be used whenever one has to deal with problems involving uncertain or incomplete knowledge

Obstacle Avoidance and Proscriptive Bayesian Programming

Unexpected events and not modeled properties of the robot environment are some of the challenges presented by situated robotics research field. Collision avoidance is a basic security requirement and this paper proposes a probabilistic approach called Bayesian Programming, which aims to deal with the uncertainty, imprecision and incompleteness of the information handled to solve the obstacle avoidance problem. Some examples illustrate the process of embodying the programmer preliminary knowledge into a Bayesian program and experimental results of these examples implementation in an electrical vehicle are described and commented. A video illustration of the developed experiments can be found at http://www.inrialpes.fr/sharp/pub/laplac

Proscriptive Bayesian Programming Application for Collision Avoidance

Evolve safely in an unchanged environment and possibly following an optimal trajectory is one big challenge presented by situated robotics research field. Collision avoidance is a basic security requirement and this paper proposes a solution based on a probabilistic approach called Bayesian Programming. This approach aims to deal with the uncertainty, imprecision and incompleteness of the information handled. Some examples illustrate the process of embodying the programmer preliminary knowledge into a Bayesian program and experimental results of these examples implementation in an electrical vehicle are described and commented. Some videos illustrating these experiments can be found at http://www-laplace.imag.fr

The Design and Implementation of a Bayesian CAD Modeler for Robotic Applications

We present a Bayesian CAD modeler for robotic applications. We address the problem of taking into account the propagation of geometric uncertainties when solving inverse geometric problems. The proposed method may be seen as a generalization of constraint-based approaches in which we explicitly model geometric uncertainties. Using our methodology, a geometric constraint is expressed as a probability distribution on the system parameters and the sensor measurements, instead of a simple equality or inequality. To solve geometric problems in this framework, we propose an original resolution method able to adapt to problem complexity. Using two examples, we show how to apply our approach by providing simulation results using our modeler

A Robotic CAD System using a Bayesian Framework

We present in this paper a Bayesian CAD system for robotic applications. We address the problem of the propagation of geometric uncertainties and how esian CAD system for robotic applications. We address the problem of the propagation of geometric uncertainties and how to take this propagation into account when solving inverse problems. We describe the methodology we use to represent and handle uncertainties using probability distributions on the system's parameters and sensor measurements. It may be seen as a generalization of constraint-based approaches where we express a constraint as a probability distribution instead of a simple equality or inequality. Appropriate numerical algorithms used to apply this methodology are also described. Using an example, we show how to apply our approach by providing simulation results using our CAD system

The Ariadne's Clew Algorithm

We present a new approach to path planning, called the ``Ariadne's clew algorithm''. It is designed to find paths in high-dimensional continuous spaces and applies to robots with many degrees of freedom in static, as well as dynamic environments --- ones where obstacles may move. The Ariadne's clew algorithm comprises two sub-algorithms, called SEARCH and EXPLORE, applied in an interleaved manner. EXPLORE builds a representation of the accessible space while SEARCH looks for the target. Both are posed as optimization problems. We describe a real implementation of the algorithm to plan paths for a six degrees of freedom arm in a dynamic environment where another six degrees of freedom arm is used as a moving obstacle. Experimental results show that a path is found in about one second without any pre-processing

Using automatic robot programming for space telerobotics

The interpreter of a task level robot programming system called Handey is described. Handey is a system that can recognize, manipulate and assemble polyhedral parts when given only a specification of the goal. To perform an assembly, Handey makes use of a recognition module, a gross motion planner, a grasp planner, a local approach planner and is capable of planning part re-orientation. The possibility of including these modules in a telerobotics work-station is discussed

Improving the Diagnosis of Acute Heart Failure Using a Validated Prediction Model

ObjectivesWe sought to derive and validate a prediction model by using N-terminal pro–B-type natriuretic peptide (NT-proBNP) and clinical variables to improve the diagnosis of acute heart failure (AHF).BackgroundThe optimal way of using natriuretic peptides to enhance the diagnosis of AHF remains uncertain.MethodsPhysician estimates of probability of AHF in 500 patients treated in the emergency department from the multicenter IMPROVE CHF (Improved Management of Patients With Congestive Heart Failure) trial recruited between December 2004 and December 2005 were classified into low (0% to 20%), intermediate (21% to 79%), or high (80% to 100%) probability for AHF and then compared with the blinded adjudicated AHF diagnosis. Likelihood ratios were calculated and multiple logistic regression incorporated covariates into an AHF prediction model that was validated internally by the use of bootstrapping and externally by applying the model to another 573 patients from the separate PRIDE (N-Terminal Pro-BNP Investigation of Dyspnea in the Emergency Department) study of the use of NT-proBNP in patients with dyspnea.ResultsLikelihood ratios for AHF with NT-proBNP were 0.11 (95% confidence interval [CI]: 0.06 to 0.19) for cut-point values <300 pg/ml; increasing to 3.43 (95% CI: 2.34 to 5.03) for values 2,700 to 8,099 pg/ml, and 12.80 (95% CI: 5.21 to 31.45) for values ≥8,100 pg/ml. Variables used to predict AHF were age, pre-test probability, and log NT-proBNP. When applied to the external data by use of its adjudicated final diagnosis as the gold standard, the model appropriately reclassified 44% of patients by intermediate clinical probability to either low or high probability of AHF with negligible (<2%) inappropriate redirection.ConclusionsA diagnostic prediction model for AHF that incorporates both clinical assessment and NT-proBNP has been derived and validated and has excellent diagnostic accuracy, especially in cases with indeterminate likelihood for AHF